Some representation theorems

Some Representation Theorems for Partially Ordered Sets

Relational Representation Theorems for Some Lattice-Based Structures

The major elements of the method of proving relational representation theorems presented in this paper are, on the one hand, Urquhart representation theorem for lattices [17] and Allwein and Dunn developments on Kripke semantics for linear logic (see [1] and also [4]), and on the other hand, a generalisation of Jonsson and Tarski ideas [9] which inspired the developments in [5], [6] and [13]. W...

Representation Theorems for Quantales

In this paper we prove that any quantale Q is (isomorphic to) a quantale of suitable relations on Q. As a consequence two isomorphism theorems are also shown with suitable sets of functions of Q into Q. These theorems are the mathematical background one needs in order to give natural and complete semantics for (non-commutative) Linear Logic using relations. 1991 Mathematics Subject Classificati...

Representation Theorems and Realism

The representation theorems of expected utility theory show that having certain types of preferences is both necessary and sufficient for being representable as having subjective probabilities. However, unless the expected utility framework is simply assumed, such preferences are also consistent with being representable as having degrees of belief that do not obey the laws of probability. This ...

Some Useful Network Theorems

Thévenin’s theorem is used to represent a part of a network by a voltage source Vt and a series impedance Zt , as shown in Fig. D.1. Figure D.1(a) shows a network divided into two parts, A and B. In Fig. D.1(b), part A of the network has been replaced by its Thévenin equivalent: a voltage source Vt and a series impedance Zt . Figure D.1(c) illustrates how Vt is to be determined: Simply open-cir...